Frame Moments and Welch Bound with Erasures

نویسندگان

  • Marina Haikin
  • Ram Zamir
  • Matan Gavish
چکیده

The Welch Bound is a lower bound on the root mean square cross correlation between n unit-norm vectors f1, ..., fn in the m dimensional space (Rm or Cm), for n ≥ m. Letting F = [f1|...|fn] denote the m-by-n frame matrix, the Welch bound can be viewed as a lower bound on the second moment of F , namely on the trace of the squared Gram matrix (F ′F ). We consider an erasure setting, in which a reduced frame, composed of a random subset of Bernoulli selected vectors, is of interest. We extend the Welch bound to this setting and present the erasure Welch bound on the expected value of the Gram matrix of the reduced frame. Interestingly, this bound generalizes to the d-th order moment of F . We provide simple, explicit formulae for the generalized bound for d = 2, 3, 4, which is the sum of the d-th moment of Wachter’s classical MANOVA distribution and a vanishing term (as n goes to infinity with m n held constant). The bound holds with equality if (and for d = 4 only if) F is an Equiangular Tight Frame (ETF). Our results offer a novel perspective on the superiority of ETFs over other frames in a variety of applications, including spread spectrum communications, compressed sensing and analog coding.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalised Welch Bound Equality sequences are tight frames

This paper shows what are called Welch bound equality (WBE) sequences by the signal processing community are precisely the isometric/equal norm/normalized/uniform tight frames which are currently being investigated for a number of applications, and in the real case are the spherical 2–designs of combinatorics. Recent applications include wavelet expansions, Grassmannian frames, frames robust to...

متن کامل

Error Correction for Erasures of Quantized Frame Coefficients

In this paper we investigate an algorithm for the suppression of errors caused by quantization of frame coefficients and by erasures in their subsequent transmission. The erasures are assumed to happen independently, modeled by a Bernoulli experiment. The algorithm for error correction in this study embeds check bits in the quantization of frame coefficients, causing a possible, but controlled ...

متن کامل

Correlation Minimizing Frames

In this dissertation, we study the structure of correlation minimizing frames. A correlation minimizing (N,d)-frame is any uniform Parseval frame of N vectors in dimension, d, such that the largest absolute value of the inner products of any pair of vectors is as small as possible. We call this value the correlation constant. These frames are important as they are optimal for the 2-erasures pro...

متن کامل

Robust dimension reduction, fusion frames, and Grassmannian packings

We consider estimating a random vector from its measurements in a fusion frame, in presence of noise and subspace erasures. A fusion frame is a collection of subspaces, for which the sum of the projection operators onto the subspaces is bounded below and above by constant multiples of the identity operator. We first consider the linear minimum mean-squared error (LMMSE) estimation of the random...

متن کامل

Binary Codes with Locality for Four Erasures

In this paper, binary codes with locality for four erasures are considered. An upper bound on the rate of this class of codes is derived. An optimal construction for codes meeting the bound is also provided. The construction is based on regular bipartite graphs of girth 6 and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1801.04548  شماره 

صفحات  -

تاریخ انتشار 2018